Upper minus domination in a claw-free cubic graph
نویسندگان
چکیده
منابع مشابه
Upper minus domination in a claw-free cubic graph
We show in this paper that the upper minus domination number −(G) of a claw-free cubic graph G is at most 1 2 |V (G)|. © 2006 Published by Elsevier B.V.
متن کاملUpper paired-domination in claw-free graphs
A set S of vertices in a graph G is a paired-dominating set of G if every vertex of G is adjacent to some vertex in S and if the subgraph induced by S contains a perfect matching. The maximum cardinality of a minimal paired-dominating set of G is the upper paired-domination number of G, denoted by pr(G). We establish bounds on pr(G) for connected claw-free graphs G in terms of the number n of v...
متن کاملOn a conjecture on total domination in claw-free cubic graphs: proof and new upper bound
In 2008, Favaron and Henning proved that if G is a connected claw-free cubic graph of order n ≥ 10, then the total domination number γt(G) of G is at most 5 11 n, and they conjectured that in fact γt(G) is at most 4 9 n (see [O. Favaron and M.A. Henning, Discrete Math. 308 (2008), 3491–3507] and [M.A. Henning, Discrete Math. 309 (2009), 32–63]). In this paper, in a first step, we prove this con...
متن کاملBounds on total domination in claw-free cubic graphs
A set S of vertices in a graphG is a total dominating set, denoted by TDS, ofG if every vertex ofG is adjacent to some vertex in S (other than itself). The minimum cardinality of a TDS ofG is the total domination number ofG, denoted by t(G). IfG does not contain K1,3 as an induced subgraph, then G is said to be claw-free. It is shown in [D. Archdeacon, J. Ellis-Monaghan, D. Fischer, D. Froncek,...
متن کاملUpper minus Total Domination Number of 6-regular Graph
Let Γ−t (G) be upper minus total domination number of G. In this paper, We establish an upper bound of the upper minus total domination number of a 6-regular graph G and characterize the extremal graphs attaining the bound. Thus, we partially answer an open problem by Yan, Yang and Shan. AMS Subject Classification: 05C69
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Discrete Mathematics
سال: 2006
ISSN: 0012-365X
DOI: 10.1016/j.disc.2005.09.050